Contraction obstructions for treewidth
نویسندگان
چکیده
منابع مشابه
Contraction obstructions for treewidth
Article history: Received 4 September 2009 Available online 3 March 2011
متن کاملContraction obstructions for connected graph searching
We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected monotone mixed search number and we deal with the the question weather the obstruction set, with respect of the contraction partial ordering, for those classes is finite. In general, there is no guarantee that th...
متن کاملContraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all subgraphs of the minimum degree. The degeneracy is polynomial time computable. We introduce the notion of contraction degeneracy: the maximum over all minors of the minimum degree. We show that the contraction degenera...
متن کاملThe Structure and Number of Obstructions to Treewidth
For each pair of nonadjacent vertices in a graph, consider the greater of the degrees of the two vertices. The minimum of these maxima is a lower bound on the treewidth of a graph, unless it is a complete graph. This bound has three consequences. First, the obstructions of order w + 3 for treewidth w have a simple structural characterization. Second, these graphs are exactly the pathwidth obstr...
متن کاملSafe separators for treewidth
A set of vertices S ⊆ V is called a safe separator for treewidth, if S is a separator of G, and the treewidth of G equals the maximum of the treewidth over all connected components W of G S of the graph, obtained by making S a clique in the subgraph of G, induced by W ∪ S. We show tha t such safe separators are a very powerful tool for preprocessing graphs when we want to compute their treewidt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2011
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.02.008